home *** CD-ROM | disk | FTP | other *** search
/ CU Amiga Super CD-ROM 19 / CU Amiga Magazine's Super CD-ROM 19 (1998)(EMAP Images)(GB)[!][issue 1998-02].iso / CUCD / Programming / LEDA / source / src / plane / _point_set.c < prev    next >
Encoding:
C/C++ Source or Header  |  1994-11-16  |  1.8 KB  |  87 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  3.1c
  4. +
  5. +
  6. +  _point_set.c
  7. +
  8. +
  9. +  Copyright (c) 1994  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16.  
  17. #include <LEDA/point_set.h>
  18. #include <LEDA/d2_dictionary.h>
  19.  
  20.  
  21. typedef d2_dictionary<double,double,DT_item>* d2_dic_ptr;
  22.  
  23. #define TTT (*d2_dic_ptr(ptr))
  24.  
  25. ps_item  Point_Set::insert(point p, void* i) 
  26. { ps_item it = delaunay_tree::insert(p,i);
  27.   TTT.insert(p.xcoord(),p.ycoord(),it);
  28.   return it;
  29.  }
  30.  
  31. list<point> Point_Set::all_points()
  32. { list<point> result;
  33.   list<ps_item>  L = all_items();
  34.   ps_item it;
  35.   forall(it,L) result.append(key(it));
  36.   return result;
  37. }
  38.  
  39.  
  40. ps_item Point_Set::lookup(point p)
  41. { double    x  = p.xcoord();
  42.   double    y  = p.ycoord();
  43.   dic2_item it = TTT.lookup(x,y);
  44.   return (it!=nil) ? TTT.inf(it) : nil;
  45. }
  46.  
  47. list<ps_item> Point_Set::range_search(double x0, double x1, double y0, double y1)
  48. {
  49.   list<dic2_item> Lr = TTT.range_search(x0,x1,y0,y1);
  50.  
  51.   list<ps_item> Lp;
  52.  
  53.   dic2_item it;
  54.  
  55.   forall(it,Lr) Lp.append(TTT.inf(it));
  56.  
  57.   return Lp;
  58.  
  59. }
  60.  
  61.  
  62. list<ps_item> Point_Set::all_items()          
  63. { list<DT_item> L; 
  64.   delaunay_tree::all_items(L); 
  65.   return *(list<ps_item>*)&L;
  66.  }
  67.  
  68.  
  69. list<ps_item> Point_Set::convex_hull()
  70. { list<DT_item> L; 
  71.   delaunay_tree::convex_hull(L);
  72.   return *(list<ps_item>*)&L;
  73.  }
  74.  
  75. void Point_Set::del(point p)
  76. { delaunay_tree::del(p);
  77.   TTT.del(p.xcoord(),p.ycoord());
  78.  }
  79.  
  80. void Point_Set::clear() { TTT.clear(); delaunay_tree::clear();  }
  81.  
  82. int  Point_Set::size()  { return TTT.size(); }
  83.  
  84. Point_Set::Point_Set()  { ptr = new d2_dictionary<double,double,DT_item>; }
  85.  
  86. Point_Set::~Point_Set() { delete d2_dic_ptr(ptr); }
  87.